наименьшее время ожидания
—
[Л.Г.Суменко. Англо-русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.]
Англо-русский словарь нормативно-технической терминологии. academic.ru. 2015.
SLTF — comp. abbr. Shortest Latency Time First electr. abbr. Shortest Latency Time First … United dictionary of abbreviations and acronyms
SLTF — abbr. Shortest Latency Time First … Dictionary of English abbreviation
наименьшее время ожидания — — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом EN shortest latency time … Справочник технического переводчика
Scheduling (computing) — This article is about processes assignment in operating systems. For other uses, see Scheduling (disambiguation). Scheduling is a key concept in computer multitasking, multiprocessing operating system and real time operating system designs.… … Wikipedia
Premature ejaculation — Infobox Disease Name = Premature ejaculation Caption = DiseasesDB = ICD10 = ICD10|F|52|4|f|50 ICD9 = ICD9|302.75 ICDO = OMIM = MedlinePlus = 001524 eMedicineSubj = med eMedicineTopic = 643 MeshID = Premature ejaculation (PE), also known as rapid… … Wikipedia
List of ad-hoc routing protocols — An Ad hoc routing protocol is a convention or standard that controls how nodes come to agree which way to route packets between computing devices in a mobile ad hoc network (MANET).In ad hoc networks , nodes do not have a priori knowledge of… … Wikipedia
Routing — This article is about routing in networks. For other uses, see Routing (disambiguation). Routing is the process of selecting paths in a network along which to send network traffic. Routing is performed for many kinds of networks, including the… … Wikipedia
Disk-drive performance characteristics — are the attributes which control the time it takes to transfer (read or write) data between a computer and a data storage device (most typically disk storage) starting with the initial command from the computer or host until the storage device… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Jitter — For other meanings of this word, see Jitter (disambiguation). Jitter is the undesired deviation from true periodicity of an assumed periodic signal in electronics and telecommunications, often in relation to a reference clock source. Jitter may… … Wikipedia
MIDI — For other uses, see MIDI (disambiguation). Note names along with their accompanying MIDI note numbers MIDI ( … Wikipedia
